Using Rewriting Logic to implement FULL
نویسندگان
چکیده
A common problem of automated tools for Formal Methods is their difficulty in dealing with infinite systems. Such systems may arise through the use of infinite data types. For example, in the LOTOS [6] formal description technique the simple process g?x : Nat; exit results in an infinite choice, one for each member of Nat. Rewriting logic [7] is a possible approach to dealing with such systems. Rewriting logic is a logic of becoming or change that can naturally deal with state and with highly nondeterministic concurrent computations. It can be used as a semantic framework for a wide range of languages and models of concurrency. Maude [4] is an executable specification language based on rewriting logic and supporting both equational and rewriting logic computation. Maude can be used as a metalanguage [3] in which executable environments for different logics, languages, and models of computation are created. Maude has powerful metaprogramming capabilities, with which the user can define strategies to guide the deduction process. We present here work on the use of rewriting logic and Maude to implement a model checker for the modal logic FULL [1]. FULL is used to describe properties over data and processes, and is verified with respect to symbolic transition systems (STS).
منابع مشابه
A rewriting logic approach to operational semantics
We show how one can use rewriting logic to faithfully capture (not implement) various operational semantic frameworks as rewrite logic theories, namely big-step and small-step semantics, reduction semantics using evaluation contexts, and continuation-based semantics. There is a one-to-one correspondence between an original operational semantics and its associated rewrite logic theory, both nota...
متن کاملImplementing term rewriting by jungle evaluation
Jungles are acyclic hypergraphs which represent sets of terms such that common subterms can be shared. Term rewrite rules are translated into jungle evaluation rules which implement parallel term rewriting steps. By using additional hypergraph rules which “fold” equal subterms, even non-left-linear term rewriting systems can be implemented. As a side effect, these folding rules can speed up the...
متن کاملA Graph Rewriting Approach for Converting Asynchronous ROMs into Synchronous Ones
Most of FPGAs have Configurable Logic Blocks (CLBs) to implement combinational and sequential circuits and block RAMs to implement Random Access Memories (RAMs) and Read Only Memories (ROMs). Circuit design that minimizes the number of clock cycles is easy if we use asynchronous read operations. However, most of FPGAs support synchronous read operations, but do not support asynchronous read ope...
متن کاملModelling Conditional Rewriting Logicin Structured
We reformulate and generalize the functorial model of Meseguer's conditional full rewriting logic by using inserter, a weighted limit in 2-categories. Indeed 2-categories are categories enriched in Cat. Therefore this method also can be extended to sesqui-categories and other enriched categories, with which we can model various aspects of rewritings and strategies.
متن کامل